Quantum Max-flow/Min-cut
نویسندگان
چکیده
The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. Although some aspects generalize , surprising counterexamples are found. We speculate that the phenomena revealed may be of interest in both spin systems in condensed matter and in quantum gravity.
منابع مشابه
The Asymptotics of Quantum Max-Flow Min-Cut
The quantum max-flow min-cut conjecture relates the rank of a tensor network to the minimum cut in the case that all tensors in the network are identical. This conjecture was shown to be false in Ref. 2 by an explicit counter-example. Here, we show that the conjecture is almost true, in that the ratio of the quantum max-flow to the quantum min-cut converges to 1 as the dimension N of the degree...
متن کاملApproximate Max-Flow Min-Cut Theorems (Course Notes Extension for COMP5703)
In this report, we discuss two approximate max-flow min-cut theorems that first introduced by Tom Leighton and Satish Rao in 1988 [9] and extended in 1999 [10] for uniform multicommodity flow problems. In the theorems they first showed that for any n-node multicommodity flow problem with uniform demands, the max-flow is a Ω(log n) factor smaller than the min-cut; further,they proved the max-flo...
متن کاملA Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks
Intrigued by the capacity of random networks, we start by proving a max-flow min-cut theorem that is applicable to any random graph obeying a suitably defined independence-in-cut property. We then show that this property is satisfied by relevant classes, including small world topologies, which are pervasive in both man-made and natural networks, and wireless networks of dual devices, which expl...
متن کاملAn Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications
In this paper , we prove the first approximate max-flow min-cut theorem for undirected mul t i commodi ty flow. We show tha t for a feasible flow to exist in a mul t icommodi ty problem, it is sufficient t ha t every cut ' s capacity exceeds its demand by a factor of O(logClogD), where C is the sum of all finite capacities and D is the sum of demands . Moreover, our theorem yields an a lgor i t...
متن کاملA Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property
Seymour proved that the set of odd circuits of a signed binary matroid (M; ) has the Max-Flow Min-Cut property if and only if it does not contain a minor isomorphic to (M(K4); E(K4)). We give a shorter proof of this result.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1508.04644 شماره
صفحات -
تاریخ انتشار 2015